Candidate Boolean Functions towards Super-Quadratic Formula Size
نویسندگان
چکیده
منابع مشابه
Best Quadratic Approximations of Cubic Boolean Functions
The problem of computing best low order approximations of Boolean functions is treated in this paper. We focus on the case of best quadratic approximations of a wide class of cubic functions of arbitrary number of variables, and provide formulas for their efficient calculation. Our methodology is developed upon Shannon’s expansion formula and properties of best affine approximations of quadrati...
متن کاملLocal Maxima of Quadratic Boolean Functions
Combinatorics, Probability and Computing / Volume 25 / Issue 04 / July 2016, pp 633 640 DOI: 10.1017/S0963548315000322, Published online: 21 December 2015 Link to this article: http://journals.cambridge.org/abstract_S0963548315000322 How to cite this article: HUNTER SPINK (2016). Local Maxima of Quadratic Boolean Functions. Combinatorics, Probability and Computing, 25, pp 633-640 doi:10.1017/S0...
متن کاملCones of Nonnegative Quadratic Pseudo-Boolean Functions
Numerous combinatorial optimization problems can be formulated as the minimization of a quadratic pseudo-Boolean function in n variables, which on its own turn is equivalent with a linear programming problem over the so called Boolean Quadric Polytope (BQ) in n+ ( 2 2 ) dimension (Padberg, 1989). This polytope is very well studied, still we know in fact very little about its structure and its f...
متن کاملMonotone, Horn and Quadratic Pseudo-Boolean Functions
A pseudo-Boolean function (pBf) is a mapping from f0; 1gn to the real numbers. It is known that pseudo-Boolean functions have polynomial representations, and it was recently shown that they also have disjunctive normal forms (DNFs). In this paper we relate the DNF syntax of the classes of monotone, quadratic and Horn pBfs to their characteristic inequalities.
متن کاملLower Bounds on Formula Size of Boolean Functions Using Hypergraph Entropy
Korner [7] defined the notion of graph-entropy. He used it in [8] to simplify the proof of the Fredman-Komlos lower bound for the family size of perfect hash functions. We use this information theoretic notion to obtain a general method for formula size lower bounds. This method can be applied to low-complexity functions for which the other known general methods ([11, 12, 3] and see also [17] )...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2015
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.2014fcp0011